Extending the Birkhoff-Von Neumann Switching Strategy to Multicast Switches
نویسندگان
چکیده
This paper extends the Birkhoff-von Neumann unicast switching strategy to the multicast case. Using a graph theoretic model we show that the rate region for a traffic pattern is precisely the stable set polytope of the pattern’s ‘conflict graph’, in the no-fanout splitting case. Computing the offline schedule is equivalent to fractional weighted graph coloring which takes polynomial time for perfect graphs. For a general conflict graph, we show that deciding achievability of a given rate vector is NP -hard, but can be done in polynomial time for the case of moderate multicast load. The result naturally leads to an offline schedule.
منابع مشابه
Extending the Birkhoff-von Neumann Switching Strategy to Multicast Switching
The Birkhoff-von Neumann (BVN) strategy for offline switching does not support multicast, as it considers only permutation-based switch configurations. This thesis extends the BVN strategy to multicast switching. Using a graph theoretic model, we show that the capacity region for a traffic pattern is precisely the stable set polytope of the pattern’s “conflict graph”, in the no-fanout-splitting...
متن کاملExtending the Birkhoff-von Neumann Switching Strategy
The Birkhoff-von Neumann (BVN) strategy for offline switching does not support multicast, as it considers only permutation-based switch configurations. This thesis extends the BVN strategy to multicast switching. Using a graph theoretic model, we show that the capacity region for a traffic pattern is precisely the stable set polytope of the pattern's "conflict graph", in the no-fanout-splitting...
متن کاملBirkhoff-von Neumann switching with statistical traffic profiles
Offline scheduling is attractive when the traffic profile is known a priori since the complexity of online scheduling is largely removed. Given any admissible rate matrix K 1⁄4 ðkijÞ, Birkhoff-von Neumann decomposition offers a quasi-offline scheduling strategy that can provide a service rate of at least kij for each flow ði; jÞ without internal speedup. This paper extends the Birkhoff-von Neum...
متن کاملDecoupled parallel hierarchical matching schedulers
The load balanced Birkhoff–von Neumann switch is an elegant VOQ architecture with two outstanding characteristics: (i) it has a computational cost of Oð1Þ iterations and (ii) input controllers do not exchange information (as a result, it allows decoupled implementations with a low power density). The load balancing stage guarantees stability under a broad class of traffic patterns. It may alter...
متن کامل